#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100;
int n,a[maxn],i,j,k,b[maxn];
void merge_sort(int a[],int left,int right){
	if(left>=right)return ;
	int mid=(left+right)/2;
	merge_sort(a,left,mid);
	merge_sort(a,mid+1,right);
	i=left,j=mid+1,k=left;
	while(i<=mid && j<=right){
		if(a[i]<=a[j]){
			b[k++]=a[i++];
		}else{
			b[k++]=a[j++];
		}
	}
	while(i<=mid){
		b[k++]=a[i++];
	}
	while(j<=right){
		b[k++]=a[j++];
	}
	for(int x=left;x<=right;x++)a[x]=b[x];
}
			
int main() {
    cin>>n;
    for(int i=0;i<n;i++)cin>>a[i];
    merge_sort(a,0,n-1);
    for(int i=0;i<n;i++)
    cout<<a[i]<<" ";
   	
    return 0;
}

